Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph

نویسنده

  • S'ebastien Forestier
چکیده

Crypto-currencies based on the blockchain architecture cannot scale to thousands of transactions per second. We design a new cryptocurrency architecture, called the blockclique, combining transaction sharding, where transactions are separated into multiple groups based on their input address, and a multithreaded directed acyclic block graph structure, where each block references one previous block of each thread. Simulations show that in a network of nodes with an average upload bandwidth of 32 Mbps, the blockclique reaches a throughput of 6, 000 transactions per second, with a 2-minutes average transaction time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chain of Trust: Can Trusted Hardware Help Scaling Blockchains?

As blockchain systems proliferate, there remains an unresolved scalability problem of their underlying distributed consensus protocols. Byzantine Fault Tolerance (BFT) consensus protocols offer high transaction throughput, but can only support small networks. Proof-of-Work (PoW) consensus protocol, on the other hand, can support thousands of nodes, but at the expense of poor transaction through...

متن کامل

Dynamic Distributed Storage for Scaling Blockchains

Blockchain uses the idea of storing transaction data in the form of a distributed ledger wherein each node in the network stores a current copy of the sequence of transactions in the form of a hash chain. This requirement of storing the entire ledger incurs a high storage cost that grows undesirably large for high transaction rates and large networks. In this work we use the ideas of secret key...

متن کامل

A Blockchain Based on Gossip? – a Position Paper

A blockchain is an append-only sequence of blocks of arbitrary data. The two most popular approaches to blockchains are permissionless blockchains based on Proof of Work (PoW) and permissioned blockchains based on Byzantine consensus or Byzantine Fault Tolerance (BFT). The first is based on competitions between anonymous participants solving cryptopuzzles, while the latter is a cooperative appr...

متن کامل

A Scale-out Blockchain for Value Transfer with Spontaneous Sharding

Blockchain technology, sometimes known by its applications like cryptocurrencies, suffers from the scalability problem mainly due to the unideal throughput of Byzantine fault tolerance consensus algorithms. Recently, many blockchains have been proposed to achieve scale-out throughput, i.e., the throughput of the system grows with the number of nodes. In this paper, we propose a novel scale-out ...

متن کامل

Sharding PoW-based Blockchains via Proofs of Knowledge

Blockchains based on proofs of work (PoW) currently account for more than 90% of the total market capitalization of existing digital cryptocurrencies. The security of PoWbased blockchains requires that new transactions are verified, making a proper replication of the blockchain data in the system essential. While existing PoW mining protocols offer considerable incentives for workers to generat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018